Definability and forcing in E-recursion.
نویسندگان
چکیده
منابع مشابه
Rudimentary recursion, provident sets and forcing
and call a set A provident if it is transitive and closed under all p-rud-rec functions with p a member of A. * If ζ is the least ordinal not in a provident set A, then ζ is indecomposable, that is, that the sum of two ordinals less than ζ is less than ζ. Conversely, if ζ is indecomposable, η > ζ and p ∈ Jζ , then the Jensen set Jη is is closed under all p-rud rec functions; in particular Jζ is...
متن کاملOuter Model Theory and the Definability of Forcing
A new notion of class forcing was defined by M.C. Stanley in [6], which is not a priori definable in the ground model. In this thesis, we explore conditions under which the Definability Lemma holds for this new notion. There are two major approaches to this problem, one direct and one indirect. The direct method makes use of a new complexity class, σ2DFn, which lies intermediate between Σn/Πn a...
متن کاملE ective models of polymorphism , subtyping and recursion ( extended
We develop a class of models of polymorphism, subtyping and recursion based on a combination of traditional recursion theory and simple domain theory. A signi cant property of our primary model is that types are coded by natural numbers using any index of their supremum operator. This leads to a distinctive view of polymorphic functions that has many of the usual parametricity properties. It al...
متن کاملExpressiveness and Definability in Circumscription
We investigate expressiveness and definability issues with respect to minimal models, particularly in the scope of Circumscription. First, we give a proof of the failure of the Löwenheim-Skolem Theorem for Circumscription. Then we show that, if the class of P ;Z-minimal models of a first-order sentence is ∆elementary, then it is elementary. That is, whenever the circumscription of a firstorder ...
متن کاملNaturality and Definability Ii
In two papers [3] and [4] we noted that in common practice many algebraic constructions are defined only ‘up to isomorphism’ rather than explicitly. We mentioned some questions raised by this fact, and we gave some partial answers. The present paper provides much fuller answers, though some questions remain open. Our main result, Theorem 4, says that there is a transitive model of Zermelo-Fraen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATHEMATICA SCANDINAVICA
سال: 1985
ISSN: 1903-1807,0025-5521
DOI: 10.7146/math.scand.a-12103